import java.util.Scanner;

public class zifuchuanadd {//https://www.nowcoder.com/practice/829ae8987a424bd6b9a95a240ebdb0e3?tpId=98&tqId=32882&tPage=3&rp=3&ru=/ta/2019test&qru=/ta/2019test/question-ranking
    public static String zifuchuanadd(String s1,String s2) {
        StringBuilder temp=new StringBuilder();
        //1.先逆置
        StringBuilder stringBuilderA=new StringBuilder(s1).reverse();
        StringBuilder stringBuilderB=new StringBuilder(s2).reverse();
        //2.找出s1与s2的max
        int lenA=s1.length();
        int lenB=s2.length();
        int max=Math.max(lenA,lenB);
        //讨论的时候，需要考虑是否进位
        Boolean is_jinwei=false;
        //3.遍历
        for(int i=0;i<max;i++){
            char chA=i>lenA?'0':stringBuilderA.charAt(i);
            char chB=i>lenB?'0':stringBuilderB.charAt(i);
            //4.开始讨论chA和chB
            if(chA=='1'&&chB=='1'){
                if(is_jinwei){
                    temp.append('1');
                }else{
                    temp.append('0');
                }
                is_jinwei=true;
            }else if(chA=='0'&&chB=='0'){
                if(is_jinwei){
                    temp.append('1');
                }else{
                    temp.append('0');
                }
                is_jinwei=false;
            }else{
                if(is_jinwei){
                    temp.append('0');
                }else{
                    temp.append('1');
                }
                //因为压根判断不了是否进位，所以等for循环结束后，单独处理把
            }
        }
        if(is_jinwei){
            temp.append('1');
        }
        return temp.reverse().toString();
    }
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNext()){//因为输入的是空格，所以用next()
            String a=scanner.next();
            String b=scanner.next();
            String ret=zifuchuanadd(a,b);
            System.out.println(ret);
        }
    }
}
